منابع مشابه
Clustered Matrix Approximation
In this paper we develop a novel clustered matrix approximation framework, first showing the motivation behind our research. The proposed methods are particularly well suited for problems with large scale sparse matrices that represent graphs and/or bipartite graphs from information science applications. Our framework and resulting approximations have a number of benefits: (1) the approximation...
متن کاملApproximation of the Clustered Set Covering Problem
We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning. We show that the problem is approximable within ratio (1+2)(e/e−1)H(q), where q is the maxi...
متن کاملClustered Sub-Matrix Singular Value Decomposition
This paper presents an alternative algorithm based on the singular value decomposition (SVD) that creates vector representation for linguistic units with reduced dimensionality. The work was motivated by an application aimed to represent text segments for further processing in a multi-document summarization system. The algorithm tries to compensate for SVD’s bias towards dominant-topic document...
متن کاملInterest zone matrix approximation
We present an algorithm for low rank approximation of matrices where only some of the entries in the matrix are taken into consideration. This algorithm appears in recent literature under different names, where it is described as an EM based algorithm that maximizes the likelihood for the missing entries without any relation for the mean square error minimization. When the algorithm is minimize...
متن کاملToeplitz Matrix Approximation
This paper deals with numerical Toeplitz matrix approximation. Our approach is based on (i) a projection algorithm which converges globally but slowly; and (ii) the quasi-Newton method which is faster. Hybrid methods that attempt to combine the best features of both methods are then considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2016
ISSN: 0895-4798,1095-7162
DOI: 10.1137/15m1042206